منابع مشابه
Clustering with shallow trees
We propose a new method for hierarchical clustering based on the optimisation of a cost function over trees of limited depth, and we derive a message–passing method that allows to solve it efficiently. The method and algorithm can be interpreted as a natural interpolation between two well-known approaches, namely single linkage and the recently presented Affinity Propagation. We analyze with th...
متن کاملRecovering Sdr Trees from Symbolic
A well known result from cluster theory states that there is a 1-to-1 correspondence between dated, compact, rooted trees and ultrametrics. In this paper, we generalize this result yielding a canonical 1-to-1 correspondence between symbolically dated trees and symbolic ultrametrics, using an arbitrary set as the set of (possible) dates or values. It turns out that a rather unexpected new condit...
متن کاملRecovering sparse signals with non-convex penalties and DC programming
This paper considers the problem of recovering a sparse signal representation according to a signal dictionary. This problem is usually formalized as a penalized least-squares problem in which sparsity is usually induced by a l1-norm penalty on the coefficient. Such an approach known as the Lasso or Basis Pursuit Denoising has been shown to perform reasonably well in some situations. However, i...
متن کاملClustering with Minimum Spanning Trees
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorithm produces a k-partition of a set of points for any given k. The algorithm constructs a minimum spanning tree of a set of representative points and removes edges that satisfy a predefined criterion. The process is repeat...
متن کاملTrees with Convex Faces and Optimal Angles
We consider drawings of trees in which all edges incident to leaves can be extended to infinite rays without crossing, partitioning the plane into infinite convex polygons. Among all such drawings we seek the one maximizing the angular resolution of the drawing. We find linear time algorithms for solving this problem, both for plane trees and for trees without a fixed embedding. In any such dra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Mathematics of Data Science
سال: 2019
ISSN: 2577-0187
DOI: 10.1137/18m121099x